Rank metric codes and their Galois duality

نویسندگان

چکیده

In this paper, we describe the Galois dual of rank metric codes in ambient space $F_Q^{n\times m}$ and $F_{Q^m}^n$, where Q=qe. We obtain connections between duality with respect to distinct inner products. Furthermore, for 0 ≤ s < e, introduce concept qsm-dual bases FQm over FQ some conditions about existence qsm-self-dual basis.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rank-metric codes and their duality theory

We compare the two duality theories of rank-metric codes proposed by Delsarte and Gabidulin, proving that the former generalizes the latter. We also give an elementary proof of MacWilliams identities for the general case of Delsarte rank-metric codes, in a form that never appeared in the literature. The identities which we derive are very easy to handle, and allow us to re-establish in a very c...

متن کامل

Rank-metric LCD codes

In this paper, we investigate the rank-metric codes which are proposed by Delsarte and Gabidulin to be complementary dual codes. We point out the relationship between Delsarte complementary dual codes and Gabidulin complementary dual codes. In finite field Fmq , we construct two classes of Gabidulin LCD MRD codes by self-dual basis (or almost self-dual basis) of Fmq over Fq. Under a suitable co...

متن کامل

Rank-metric codes and applications

The State of Art for rank codes is represented. The theory and applications are considered.

متن کامل

Properties of Rank Metric Codes

This paper investigates general properties of codes with the rank metric. First, we investigate asymptotic packing properties of rank metric codes. Then, we study sphere covering properties of rank metric codes, derive bounds on their parameters, and investigate their asymptotic covering properties. Finally, we establish several identities that relate the rank weight distribution of a linear co...

متن کامل

Rank-Metric Codes and $q$-Polymatroids

We study some algebraic and combinatorial invariants of rank-metric codes, specifically generalized weights. We introduce q-polymatroids, the q-analogue of polymatroids, and develop their basic properties. We show that rank-metric codes give rise to q-polymatroids, and that several of their structural properties are captured by the associated combinatorial object. Introduction and Motivation Du...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

سال: 2023

ISSN: ['1745-1337', '0916-8508']

DOI: https://doi.org/10.1587/transfun.2022eal2090